Bitwise Operations Related to a Combinatorial Problem on Binary Matrices

Bitwise Operations Related to a Combinatorial Problem on Binary Matrices

Some techniques for the use of bitwise operations are described in the article. As an example, an open problem of isomorphism-free generations of combinatorial objects is discussed. An equivalence relation on the set of square binary matrices having the same number of units in each row and each column is defined. Each binary matrix is represented using ordered n-tuples of natural numbers. It is...

Fibonacci sequence related to a combinatorial problem on binary matrices

We discuss an equivalence relation on the set of square binary matrices with the same number of 1’s in each row and each column. Each binary matrix is represented using ordered n-tuples of natural numbers. We give a few starting values of integer sequences related to the discussed problem. The obtained sequences are new and they are not described in the On-Line Encyclopedia of Integer Sequences...

The bitwise operations related to a fast sorting algorithm

in the work we discuss the benefit of using bitwise operations in programming. Some interesting examples in this respect have been shown. What is described in detail is an algorithm for sorting an integer array with the substantial use of the bitwise operations. Besides its correctness we strictly prove that the described algorithm works in time O(n). In the work during the realization of each ...

Bitwise Operations under RAMBO

In this paper we study the problem of computing w-bit bitwise operations using only O(1) memory probes. We show that under the RAM model there exists a Ω(2) space lower bound while under the RAMBO model this space bound goes down to O(w) bits. We present algorithms that use four different RAMBO memory topologies to perform bitwise boolean operations and shift operations.

Combinatorial problems related to origin-destination matrices